Enumeration of simple random walks and tridiagonal matrices
نویسندگان
چکیده
منابع مشابه
Random doubly stochastic tridiagonal matrices
Let Tn be the compact convex set of tridiagonal doubly stochastic matrices. These arise naturally in probability problems as birth and death chains with a uniform stationary distribution. We study ‘typical’ matrices T ∈ Tn chosen uniformly at random in the set Tn. A simple algorithm is presented to allow direct sampling from the uniform distribution on Tn. Using this algorithm, the elements abo...
متن کاملRandom vicious walks and random matrices
Lock step walker model is a one-dimensional integer lattice walker model in discrete time. Suppose that initially there are infinitely many walkers on the non-negative even integer sites. At each tick of time, each walker moves either to its left or to its right with equal probability. The only constraint is that no two walkers can occupy the same site at the same time. It is proved that in the...
متن کاملRandom matrices and enumeration of maps
We review recent developments in random matrix theory related with the enumeration of connected oriented graphs called maps. In particular, we show that the long standing use of matrix integrals in physics to tackle such issues can be made rigorous and discuss some applications. This talk is based on joint works with E. Maurel-Segala and O. Zeitouni. Mathematics Subject Classification (2000). P...
متن کاملCorrelation matrices of continuous-time random walks
We present eigenvalue spectra of correlation matrices of synthetic uncorrelated continuous-time random walks. Processes of this kind are used e.g. to model high-frequency financial time series, but are also rigorously connected to the time and space fractional diffusion equation. A new method for the fast production of Mittag-Leffler random numbers already used by us to solve the fractional dif...
متن کاملSimple Random Walks on Radio Networks (Simple Random Walks on Hyper-Graphs)
In recent years, protocols that are based on the properties of random walks on graphs have found many applications in communication and information networks, such as wireless networks, peer-to-peer networks and the Web. For wireless networks (and other networks), graphs are actually not the correct model of the communication; instead hyper-graphs better capture the communication over a wireless...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics A: Mathematical and General
سال: 2002
ISSN: 0305-4470,1361-6447
DOI: 10.1088/0305-4470/35/5/302